A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.     

机载航电系统射频隐身性能多域联合评估方法

针对机载航电系统自身辐射源特性,提出一种不依赖敌方探测设备的机载航电系统射频隐身性能评估方法。分析机载航电系统设备在极化域、波形域、能量域中影响射频隐身性能的因素,构建极化域、能量域、波形域射频隐身指标,打破常规的"辐射-接收"模型的隐身性能评估方法,建立基于机载航电系统自身辐射信号工作状态和工作参数的射频隐身定量评估方法。对机载雷达系统进行仿真评估,结果表明,该评估方法能正确反映机载雷达系统的射频隐身性能。     

Turbo C与Microsoft FORTRAN混合编程的实现

本文通过研究Borland公司的Turbo C与Microsoft公司的FORTRAN混合编程时出现的问题,提出了修改初始化模块及函数库的原理与方法,并利用TLINK的动态连接功能,实现了这两种语言在源程序级的混合编程,最后说明了实现过程与注意事项。     

变量有界线性目标规划的对偶算法

本文讨论了变量有界的线性目标规划问题,给出了求解这类问题的一个对偶算法,此方法与变量有界线性规划问题的对偶算法相类似。文中证明了算法的有效性,并举例说明了计算过程。     

并行程序设计语言在串行机上的编译实现

目前,诸如Fortran 8x 程序设计语言中已经引入了并行运算成份。这给普通串行(标量)机上实现编译器带来了困难。本文提出了数组(矩阵)运算串行化的概念,并给出了串行化的判别准则及算法。     

单片微型计算机的最新开发技术

本文以 MCS-51系列单片微型机为例,讨论了当前单片机最新编程技术 MBASIC 语言编程和在 IBM-PC 机及兼容机中直接进行模拟/调试,文中给出相应的例子。     

1553B 总线仿真系统总线控制软件设计

就仿真系统对１５５３Ｂ单层总线系统和层次总线系统的总线控制软件设计进行了研究,给出了提高系统效率的方案和优化１５５３Ｂ总线数据流的方法。     

C~3Ⅰ战术模拟技术研究与实现

针对Ｃ￣３Ｉ系统战术模拟实用需求,文章重点对战术想定方案提出、软件系统应用软件模块编程设计,以及有关关键技术应用等进行了研究。该文可对Ｃ￣３Ｉ软件系统技术设计提供参考。     

基于输出协方差配置的车辆振动控制系统设计

通过对车辆振动系统的振动特性分析,确定出系统反馈控制的设计目标。基于对［１］中状态协方差配置控制理论的推广,文中给出了控制器设计的具体方法,并举例说明该设计方法具有直接有效的特点